kw.\*:("Communicating process")
Results 1 to 25 of 1833
Selection :
Support for graphs of processes in a command interpreterMCDONALD, C; DIX, T. I.Software, practice & experience. 1988, Vol 18, Num 10, pp 1011-1016, issn 0038-0644Article
Categories for modelling communicating processesLABELLA, A; PETTOROSSI, A.Computers and artificial intelligence. 1987, Vol 6, Num 3, pp 279-296, issn 0232-0274Article
An efficiency preorder for processes = Un préordre efficace pour les processusARUN-KUMAR, S; HENNESSY, M.Acta informatica. 1992, Vol 29, Num 8, pp 737-760, issn 0001-5903Article
Evaluating the performance of MPI-2 dynamic communicators and one-sided communicationGABRIEL, Edgar; FAGG, Graham E; DONGARRA, Jack J et al.Lecture notes in computer science. 2003, pp 88-97, issn 0302-9743, isbn 3-540-20149-1, 10 p.Conference Paper
Bisimulation for higher-order process calculiSANGIORGI, D.Information and computation (Print). 1996, Vol 131, Num 2, pp 141-178, issn 0890-5401Article
Specification oriented semantics for communicating processesOLDEROG, E.-R; HOARE, C. A. R.Acta informatica. 1986, Vol 23, Num 1, pp 9-66, issn 0001-5903Article
An approximate model of processor communication rings under heavy loadCOFFMAN, E. G; FLATTO, L; GILBERT, E. N et al.Information processing letters. 1997, Vol 64, Num 2, pp 61-67, issn 0020-0190Article
From ATP to timed graphs and hybrid systemsNICOLLIN, X; SIFAKIS, J; YOVINE, S et al.Acta informatica. 1993, Vol 30, Num 2, pp 181-202, issn 0001-5903Article
Etudes et mises en œuvre d'outils de vérification basée sur la bisimulation = Studies and implementations of verification tools based on disimulationBouali, Amar; Nivat, Maurice.1993, 150/160 pThesis
A new class of binary CSPs for which arc-consistency is a decision procedureCOHEN, David A.Lecture notes in computer science. 2003, pp 807-811, issn 0302-9743, isbn 3-540-20202-1, 5 p.Conference Paper
The hardness of Hensel lifting: The case of RSA and discrete logarithmCATALANO, Dario; NGUYEN, Phong Q; STERN, Jacques et al.Lecture notes in computer science. 2002, pp 299-310, issn 0302-9743, isbn 3-540-00171-9, 12 p.Conference Paper
User-process communication performance in networks of computersCABRERA, L.-F; HUNTER, E; KARELS, M. J et al.IEEE transactions on software engineering. 1988, Vol 14, Num 1, pp 38-53, issn 0098-5589Article
Systèmes PARallèles Communicants. Etude du non-déterminisme : comparaison des comportements des processus = Parallel communicating systems. Study of non-determinary: comparison of processes behaviorsROGE, Sylvie.Rapport de recherche - Informatique et mathématiques appliquées de Grenoble, ISSN: 0750-7380 ; 541. 1985, 76 p.Report
A capability calculus for concurrency and determinismTERAUCHI, Tachio; AIKEN, Alex.Lecture notes in computer science. 2006, pp 218-232, issn 0302-9743, isbn 3-540-37376-4, 1Vol, 15 p.Conference Paper
Reversible communicating systemsDANOS, Vincent; KRIVINE, Jean.Lecture notes in computer science. 2004, pp 292-307, issn 0302-9743, isbn 3-540-22940-X, 16 p.Conference Paper
The reachability analysis in communicating processes founded in term transition systemPEREIRA, Juan Manuel; RODRIGUEZ, Carlos.Rapport de recherche - Informatique et mathématiques appliquées de Grenoble, ISSN: 0750-7380 ; 567. 1985, 10 p.Report
A Finite Equational Base for CCS with Left Merge and Communication MergeACETO, Luca; FOKKINK, Wan; INGOLFSDOTTIR, Anna et al.Lecture notes in computer science. 2006, pp 492-503, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper
Concurrency and atomocity; Parallélisme et atomicitéBOUDOL, Gérard; CASTELLANI, Ilaria.Rapports de recherche - INRIA. 1987, Vol 748, issn 0249-6399, 47 p.Report
A complete inference system for an algebra of regular acceptance modelsGRAF, Susanne.Rapport de recherche - Informatique et mathématiques appliquées de Grenoble, ISSN: 0750-7380 ; 581. 1986, 24 p.Report
Expression et réalisation du contrôle d'exécution dans un système réparti = Expression and implementation of execution control in a distributed systemROZIER, Marc; KRAKOWIAK, Sacha.1986, 184 pThesis
Specifying concurrent objects as communicating processesJAYADEV MISRA.Science of computer programming. 1990, Vol 14, Num 2-3, pp 159-184, issn 0167-6423, 26 p.Article
Usefulness and usage of SKaMPI-benchAUGUSTIN, Werner; WORSCH, Thomas.Lecture notes in computer science. 2003, pp 63-70, issn 0302-9743, isbn 3-540-20149-1, 8 p.Conference Paper
Abstract games for infinite state processesSTEVENS, P.Lecture notes in computer science. 1998, pp 147-162, issn 0302-9743, isbn 3-540-64896-8Conference Paper
Resource based models for asynchronyRATHKE, J.Lecture notes in computer science. 1998, pp 273-287, issn 0302-9743, isbn 3-540-64300-1Conference Paper
Conception et évaluation d'une plate-forme pour le placement dynamique de processus communicants = Design and estimate of a platform for the dynamic scheduling of communicating processesBernon, Carole; Betourne, C.1995, 190 p.Thesis